a(a(b(x1))) → b(b(a(a(x1))))
b(a(x1)) → a(c(b(x1)))
↳ QTRS
↳ DependencyPairsProof
a(a(b(x1))) → b(b(a(a(x1))))
b(a(x1)) → a(c(b(x1)))
A(a(b(x1))) → B(b(a(a(x1))))
A(a(b(x1))) → B(a(a(x1)))
B(a(x1)) → A(c(b(x1)))
A(a(b(x1))) → A(x1)
A(a(b(x1))) → A(a(x1))
B(a(x1)) → B(x1)
a(a(b(x1))) → b(b(a(a(x1))))
b(a(x1)) → a(c(b(x1)))
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
A(a(b(x1))) → B(b(a(a(x1))))
A(a(b(x1))) → B(a(a(x1)))
B(a(x1)) → A(c(b(x1)))
A(a(b(x1))) → A(x1)
A(a(b(x1))) → A(a(x1))
B(a(x1)) → B(x1)
a(a(b(x1))) → b(b(a(a(x1))))
b(a(x1)) → a(c(b(x1)))
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
↳ AND
↳ QDP
↳ QDPOrderProof
↳ QDP
B(a(x1)) → B(x1)
a(a(b(x1))) → b(b(a(a(x1))))
b(a(x1)) → a(c(b(x1)))
The following pairs can be oriented strictly and are deleted.
The remaining pairs can at least be oriented weakly.
B(a(x1)) → B(x1)
The value of delta used in the strict ordering is 4.
POL(B(x1)) = (4)x_1
POL(a(x1)) = 1 + (4)x_1
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
↳ AND
↳ QDP
↳ QDPOrderProof
↳ QDP
↳ PisEmptyProof
↳ QDP
a(a(b(x1))) → b(b(a(a(x1))))
b(a(x1)) → a(c(b(x1)))
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
↳ AND
↳ QDP
↳ QDP
↳ QDPOrderProof
A(a(b(x1))) → A(x1)
A(a(b(x1))) → A(a(x1))
a(a(b(x1))) → b(b(a(a(x1))))
b(a(x1)) → a(c(b(x1)))
The following pairs can be oriented strictly and are deleted.
The remaining pairs can at least be oriented weakly.
A(a(b(x1))) → A(x1)
A(a(b(x1))) → A(a(x1))
The value of delta used in the strict ordering is 16.
POL(c(x1)) = (1/4)x_1
POL(a(x1)) = 1/4 + (4)x_1
POL(A(x1)) = (2)x_1
POL(b(x1)) = 2 + x_1
a(a(b(x1))) → b(b(a(a(x1))))
b(a(x1)) → a(c(b(x1)))
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
↳ AND
↳ QDP
↳ QDP
↳ QDPOrderProof
↳ QDP
↳ PisEmptyProof
a(a(b(x1))) → b(b(a(a(x1))))
b(a(x1)) → a(c(b(x1)))